Detecting Infeasible Paths via Mining Branch Correlations
نویسندگان
چکیده
منابع مشابه
Automatically Detecting Equivalent Mutants and Infeasible Paths
Mutation testing is a technique for testing software units that has great potential for improving the quality of testing, and thereby increasing our ability to assure the high reliability of critical software. It will be shown that recent advances in mutation research have brought a practical mutation testing system closer to reality. One recent advance is a partial solution to the problem of a...
متن کاملAutomatic detection of infeasible paths in software testing
A challenging problem in path-oriented test data generation is the presence of infeasible paths. Timely detecting these infeasible paths cannot only save test resources but also improve test efficiency. A popular method of detecting infeasible paths is to determine branch correlations, which is a difficult task and usually cannot be done timely and exactly. In this study, the authors propose a ...
متن کاملDetecting Infeasible Traces in Process Models
Workflow testing is an important method of workflow analysis in design time. A challenging problem with trace-oriented test data generation in particular and trace-based workflow analysis in general is the existence of infeasible traces for which there is no input data for them to be executed. In this paper we build on the theory of workflow nets and introduce workflow nets where transitions ha...
متن کاملInfeasible Basis Paths Detection of Program with Exception-Handling Constructs
Infeasible paths increase the complexity and redundancy to programs. It is a key problem of structural testing to detect the infeasible paths. The paper proposes an infeasible basis paths detecting method for the program with exception constructs based on the correlations of different conditional statements. The technique combines exception propagation with the correlations of different conditi...
متن کاملInfeasible Paths Elimination by Symbolic Execution Techniques - Proof of Correctness and Preservation of Paths
TRACER [1] is a tool for verifying safety properties of sequential C programs. TRACER attempts at building a finite symbolic execution graph which over-approximates the set of all concrete reachable states and the set of feasible paths. We present an abstract framework for TRACER and similar CEGAR-like systems [2, 3, 4, 5, 6]. The framework provides 1) a graphtransformation based method for red...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software Engineering
سال: 2012
ISSN: 1819-4311
DOI: 10.3923/jse.2012.65.78